TSTP Solution File: SYN996^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN996^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 08:31:08 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 14 unt; 3 typ; 0 def)
% Number of atoms : 44 ( 13 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 59 ( 4 ~; 0 |; 0 &; 52 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 ^ 16 !; 9 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_r,type,
r: $i > $i > $o ).
thf(tp_sK1_X,type,
sK1_X: ( $i > $i ) > $i ).
thf(tp_sK2_Y,type,
sK2_Y: $i > $i ).
thf(1,conjecture,
( ! [X: $i] :
? [Y: $i] : ( r @ X @ Y )
=> ? [F: $i > $i] :
! [X: $i] : ( r @ X @ ( F @ X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
( ( ! [X: $i] :
? [Y: $i] : ( r @ X @ Y )
=> ? [F: $i > $i] :
! [X: $i] : ( r @ X @ ( F @ X ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [X: $i] :
? [Y: $i] : ( r @ X @ Y )
=> ? [F: $i > $i] :
! [X: $i] : ( r @ X @ ( F @ X ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: $i] :
? [Y: $i] : ( r @ X @ Y ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ? [F: $i > $i] :
! [X: $i] : ( r @ X @ ( F @ X ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ? [F: $i > $i] :
! [X: $i] : ( r @ X @ ( F @ X ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [F: $i > $i] :
~ ( r @ ( sK1_X @ F ) @ ( F @ ( sK1_X @ F ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [X: $i] : ( r @ X @ ( sK2_Y @ X ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( ! [X: $i] : ( r @ X @ ( sK2_Y @ X ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [F: $i > $i] :
~ ( r @ ( sK1_X @ F ) @ ( F @ ( sK1_X @ F ) ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
! [SV1: $i] :
( ( r @ SV1 @ ( sK2_Y @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(12,plain,
! [SV2: $i > $i] :
( ( ~ ( r @ ( sK1_X @ SV2 ) @ ( SV2 @ ( sK1_X @ SV2 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(13,plain,
! [SV2: $i > $i] :
( ( r @ ( sK1_X @ SV2 ) @ ( SV2 @ ( sK1_X @ SV2 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(14,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[11,13]) ).
thf(15,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN996^1 : TPTP v8.1.0. Released v3.7.0.
% 0.06/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 01:47:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 0
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.35 (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.13/0.37 ********************************
% 0.13/0.37 * All subproblems solved! *
% 0.13/0.37 ********************************
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:14,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.37
% 0.13/0.37 %**** Beginning of derivation protocol ****
% 0.13/0.37 % SZS output start CNFRefutation
% See solution above
% 0.13/0.37
% 0.13/0.37 %**** End of derivation protocol ****
% 0.13/0.37 %**** no. of clauses in derivation: 15 ****
% 0.13/0.37 %**** clause counter: 14 ****
% 0.13/0.37
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:14,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------